Fast Discrete Linear Canonical Transform Based on CM-CC-CM Decomposition and FFT
نویسندگان
چکیده
منابع مشابه
Two-dimensional nonseparable discrete linear canonical transform based on CM-CC-CM-CC decomposition
As a generalization of the 2D Fourier transform (2D FT) and 2D fractional Fourier transform, the 2D nonseparable linear canonical transform (2D NsLCT) is useful in optics and signal and image processing. To reduce the digital implementation complexity of the 2D NsLCT, some previous works decomposed the 2D NsLCT into several low-complexity operations, including 2D FT, 2D chirp multiplication (2D...
متن کاملA fast FFT-based discrete Legendre transform
An O(N(logN)2/ loglogN) algorithm for computing the discrete Legendre transform and its inverse is described. The algorithm combines a recently developed fast transform for converting between Legendre and Chebyshev coefficients with a Taylor series expansion for Chebyshev polynomials about equallyspaced points in the frequency domain. Both components are based on the FFT, and as an intermediate...
متن کاملSampling Rate Conversion in the Discrete Linear Canonical Transform Domain
Sampling rate conversion (SRC) is one of important issues in modern sampling theory. It can be realized by up-sampling, filtering, and down-sampling operations, which need large complexity. Although some efficient algorithms have been presented to do the sampling rate conversion, they all need to compute the N-point original signal to obtain the up-sampling or the down-sampling signal in the tim...
متن کاملFast Fourier Transform ( FFT )
The DFT can be reduced from exponential time with the Fast Fourier Transform algorithm. Fast Fourier Transform (FFT) One wonders if the DFT can be computed faster: Does another computational procedure an algorithm exist that can compute the same quantity, but more e ciently. We could seek methods that reduce the constant of proportionality, but do not change the DFT's complexity O ( N ) . Here,...
متن کاملLecture 20: Discrete Fourier Transform and FFT
basically saying we care not about the rest of x[n], since it is zero. Pretend that it is periodic for analysis purpose since for the DFT it makes no difference. Defined only for 0≤ n,k ≤ N−1. The rest is zero. This means the inherent periodicity is not represented. Notation x[n] DFT ←→ X [k] Lots of properties (similar to DFS) circular convolution is important. Given x1[n] and x2[n], form x̃1[n...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Signal Processing
سال: 2016
ISSN: 1053-587X,1941-0476
DOI: 10.1109/tsp.2015.2491891